Segmentation and dimensionality reduction
نویسندگان
چکیده
Sequence segmentation and dimensionality reduction have been used as methods for studying high-dimensional sequences — they both reduce the complexity of the representation of the original data. In this paper we study the interplay of these two techniques. We formulate the problem of segmenting a sequence while modeling it with a basis of small size, thus essentially reducing the dimension of the input sequence. We give three different algorithms for this problem: all combine existing methods for sequence segmentation and dimensionality reduction. For two of the proposed algorithms we prove guarantees for the quality of the solutions obtained. We describe experimental results on synthetic and real datasets, including data on exchange rates and genomic sequences. Our experiments show that the algorithms indeed discover underlying structure in the data, including both segmental structure and interdependencies between the dimensions.
منابع مشابه
2D Dimensionality Reduction Methods without Loss
In this paper, several two-dimensional extensions of principal component analysis (PCA) and linear discriminant analysis (LDA) techniques has been applied in a lossless dimensionality reduction framework, for face recognition application. In this framework, the benefits of dimensionality reduction were used to improve the performance of its predictive model, which was a support vector machine (...
متن کاملMicroscopic image segmentation based on pixel classification and dimensionality reduction
Pathological image analysis plays a significant role in effective disease diagnostics. In this article, a tool for diagnosis assistance by automatic segmentation of bone marrow images is introduced. The aim of our segmentation is to demarcate cell's component: nucleus, cytoplasm, red cells, and background. Different color spaces were used to extract color's features to profit of their complemen...
متن کاملMDS-based segmentation model for the fusion of contour and texture cues in natural images
In this paper, we present an original image segmentation model based on a preliminary spatially adaptive non-linear data dimensionality reduction step integrating contour and texture cues. This new dimensionality reduction model aims at converting an input texture image into a noisy color image in order to greatly simplify its subsequent segmentation. In this latter de-texturing model, the (spa...
متن کاملDimensionality Reduction in Deep Learning for Chest X-Ray Analysis of Lung Cancer
Efficiency of some dimensionality reduction techniques, like lung segmentation, bone shadow exclusion, and tdistributed stochastic neighbor embedding (t-SNE) for exclusion of outliers, is estimated for analysis of chest X-ray (CXR) 2D images by deep learning approach to help radiologists identify marks of lung cancer in CXR. Training and validation of the simple convolutional neural network (CN...
متن کاملGPU Accelerated Vessel Segmentation Using Laplacian Eigenmaps
1. Abstract Laplacian eigenmap is a useful technique to improve clusterbased segmentation of multivariate images. However, this approach requires an excessive amount of computations when processing large image datasets. To that end, we present a GPU-based acceleration procedure for vessel segmentation problems. 2. Laplacian Eigenmap As described in Laskaris et. al. [1], the Laplacian Eigenmap i...
متن کاملProximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as vertices. This graph is then partitioned (clustering) or used to redefine metric information (dimensionality reduction). There has been much recent work on new methods for graph-based clustering and dimensionality red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006